Approximation Capability of Independent Wavelet Models to Heterogeneous Network Traffic - INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies
نویسندگان
چکیده
AbstmctIn our previous work, we showed empirically that independent wavelet models were parsimonious, computationally efficient, and accurate in modeling heterogeneous network traffic measured by both auto-covariance functions and buffer loss rate. In this work, we focus on auto-covariance functions, to establish a theory of independent wavelet models as unified models for heterogeneous network traffic. We have developed the theory on the approximation capability of independent wavelet models for heterogeneous trafflc in terms of the decay rate of auto-covariance functions at large lags. Average auto-covariance functions of independent wavelet models have been derived and shown to be linear combinations of basis functions. Through a simple analytical expression, we have shown that the decay rate of the auto-covariance functions of independent wavelet models is determined explicitly through a single quantity called the rate function of variances of wavelet coefficients. By specifying analytical forms of the rate function, independent wavelet models have been shown as unified models of heterogeneous traffic in terms of auto-covariance functions. The simplicity of the theory thereby provides both quantitative and qualitative explanations why independent wavelet models are unified models of heterogeneous traffic.
منابع مشابه
Approximation Capability of Independent Wavelet Models to Heterogeneous Network Traffic
In our previous work, we showed empirically that independent wavelet models were parsimonious, computationally efficient, and accurate in modeling heterogeneous network traffic measured by both auto-covariance functions and buffer loss rate. In this work, we focus on auto-covariance functions, to establish a theory of independent wavelet models as unified models for heterogeneous network traffi...
متن کاملHop-Reservation Multiple Access (HRMA) for Ad-Hoc Networks - INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies
AbsfrucfA new multichannel MAC protocol called Hop-Reservation Multiple Access (HRMA) for wireless ad-hoc networks (multi-hop packet radio networks) is introduced, specified and analyzed. HRMA is based on simple half-duplex, very-slow frequency-hopping spread spectrum (FHSS) radios and takes advantage of the time synchronization necessary for frequency hopping. HRMA allows a pair of communicati...
متن کاملMulticast Session Membership Size Estimation - INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies
AbsfructWe derive estimators and bounds that drive probabilistic polling algorithms for the estimation of the session size, n, of any.potentially large scale multicast session. We base our analysis upon a mapping of polling mechanisms to the problem of estimating the parameter n of the binomial ( n , p ) distribution. From the binomial model, we derive an interval estimator for n, and we charac...
متن کاملComputing Approximate Blocking Probabilities in Wavelength Routed All-Optical Networks with Limited- - INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies
Absfrcrcf-In this paper, we propose a method to calculate the average blocking probability in all-optical networks using limited-rmge wavelength conversion. Previous works have shown that there is a remarkable improvement in blocking probability while using limited-range wavelength conversion [2], [3] but these analytical models were either for a path [2] or for a mesh-torus network [3]. Using ...
متن کاملResource Allocation in a Multicast Tree - INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies
We consider how to allocate bandwidth in a multicast tree so as to optimize some global measure of performance. In our model each receiver has a budget to be used for bandwidth reservation on links along its path from the source, and each link has a cost function depending on the amount of total bandwidth resewed at the link by all receivers using that link We formulate and solve a problem of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999